Movable Separability of Sets
نویسندگان
چکیده
An exact hidden sphere algorithm that operates in linear time " , Comput
منابع مشابه
Movable Dominating Sensor Sets in Networks
In this paper we consider 1-movable dominating sets, motivated by the use of sensors employed to detect certain events in networks, where the sensors have a limited ability to react under changing conditions in the network. A 1-movable dominating set is a dominating set S ⊆ V (G) such that for every v ∈ S, either S − {v} is a dominating set, or there exists a vertex u ∈ (V (G) − S) ∩ N(v) such ...
متن کاملRed-Blue Separability Problems in 3D
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane.
متن کاملSeparability of Reachability Sets of Vector Addition Systems
Given two families of sets F and G, the F separability problem for G asks whether for two given sets U, V ∈ G there exists a set S ∈ F , such that U is included in S and V is disjoint with S. We consider two families of sets F : modular sets S ⊆ N, defined as unions of equivalence classes modulo some natural number n ∈ N, and unary sets. Our main result is decidability of modular and unary sepa...
متن کاملSeparability by two lines and by flat polygonals∗
In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N logN)-time optimal algorithms for computing all the separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and the flattest minimal constant turn polygonal line separating two sets of points.
متن کاملOn linear separability of data sets in feature space
In this paper we focus our topic on linear separability of two data sets in feature space, including finite and infinite data sets. We first develop a method to construct a mapping that maps original data set into a high dimensional feature space, on which inner product is defined by a dot product kernel. Our method can also be applied to the Gaussian kernels. Via this mapping, structure of fea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985